An Effective Adaptive Multi-objective Particle Swarm for Multimodal Constrained Function Optimization
نویسندگان
چکیده
This paper presents a novel adaptive multiobjective particle swarm optimization algorithm and with adaptive multi-objective particle swarm algorithm for solving objective constrained optimization problems, in which Pareto non-dominated ranking, tournament selection, crowding distance method were introduced, simultaneously the rate of crowding distance changing were integrated into the algorithm. Finally, ten standard functions are used to test the performance of the algorithm, experimental results show that the proposed approach is an efficient and achieve a high-quality performance.
منابع مشابه
A Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network
Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...
متن کاملAn Interactive Fuzzy Satisfying Method Based on Particle Swarm Optimization for Multi-Objective Function in Reactive Power Market
Reactive power plays an important role in supporting real power transmission, maintaining system voltages within proper limits and overall system reliability. In this paper, the production cost of reactive power, cost of the system transmission loss, investment cost of capacitor banks and absolute value of total voltage deviation (TVD) are included into the objective function of the power flow ...
متن کاملA Constrained Multi-objective Particle Swarm Optimization Algorithm Based on Adaptive Penalty and Normalized Non-dominated Sorting
In order to deal with constrained multi-objective optimization problems (CMOPs), a novel constrained multi-objective particle swarm optimization (CMOPSO) algorithm is proposed based on an adaptive penalty technique and a normalized non-dominated sorting technique. The former technique is utilized to optimize constrained individuals in each generation to obtain new objective functions, while the...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 5 شماره
صفحات -
تاریخ انتشار 2010